Stochastic on-time arrival problem in transit networks
نویسندگان
چکیده
منابع مشابه
Arrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملTractable Pathfinding for the Stochastic On-Time Arrival Problem
We present a new technique for fast computation of the route that maximizes the probability of on-time arrival in stochastic networks, also known as the path-based stochastic on-time arrival (SOTA) problem. We utilize the solution to the policy-based SOTA problem, which is of pseudopolynomial time complexity in the time budget of the journey, as a heuristic for efficiently computing the optimal...
متن کاملSpeedup Techniques for the Stochastic on-time Arrival Problem
We consider the stochastic on-time arrival (SOTA) routing problem of finding a routing policy that maximizes the probability of reaching a given destination within a pre-specified time budget in a road network with probabilistic link travel-times. The goal of this work is to provide a theoretical understanding of the SOTA problem and present efficient computational techniques to enable the deve...
متن کاملPrecomputation techniques for the stochastic on-time arrival problem
We consider the stochastic on-time arrival (SOTA) problem of finding the optimal routing strategy for reaching a given destination within a pre-specified time budget and provide the first results on using preprocessing techniques for speeding up the query time. We start by identifying some properties of the SOTA problem that limit the types of preprocessing techniques that can be used in this s...
متن کاملarrival probability in the stochastic networks with an established discrete time markov chain
the probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. a discrete time markov chain with an absorbing state is established in a directed acyclic network. then, the probability of transition from the initial state to the absorbing state is computed. it is as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2019
ISSN: 0191-2615
DOI: 10.1016/j.trb.2018.11.013